Dynamic Bandwidth Allocation for ATMSwitches

We explore a dynamic approach to the problems of call admission and resource allocation for communication networks with connections that are differentiated by their quality of service requirements. In a dynamic approach, the amount of spare resources is estimated on-line based on feedbacks from the network's quality of service monitoring mechanism. The schemes we propose remove the dependence on accurate traac models and thus simplify the tasks of supplying traac statistics required of network users. In this paper we present two dynamic algorithms. The objective of these algorithms is to nd the minimum bandwidth necessary to satisfy a cell loss probability constraint at an Asynchronous Transfer Mode (ATM) switch. We show that in both schemes the bandwidth chosen by the algorithm approaches the optimal value almost surely. Furthermore, in the second scheme, which determines the point closest to the optimal bandwidth from a nite number of choices, the expected learning time is nite.